Series which are both max-plus and min-plus rational are unambiguous

نویسندگان

  • Sylvain Lombardy
  • Jean Mairesse
چکیده

Consider partial maps Σ∗ −→ R with a rational domain. We show that two families of such series are actually the same: the unambiguous rational series on the one hand, and the max-plus and min-plus rational series on the other hand. The decidability of equality was known to hold in both families with different proofs, so the above unifies the picture. We give an effective procedure to build an unambiguous automaton from a max-plus automaton and a min-plus one that recognize the same series.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton

Finite automata with weights in the max-plus semiring are considered. The main result is: it is decidable in an effective way whether a series that is recognized by a finitely ambiguous max-plus automaton is unambiguous, or is sequential. A collection of examples is given to illustrate the hierarchy of max-plus series with respect to ambiguity.

متن کامل

Deciding Unambiguity and Sequentiality starting from a Finitely Ambiguous Max-Plus Automaton

Finite automata with weights in the max-plus semiring are considered. The main result is: it is decidable in an effective way whether a series that is recognized by a finitely ambiguous max-plus automaton is unambiguous, or is sequential. A collection of examples is given to illustrate the hierarchy of max-plus series with respect to ambiguity.

متن کامل

The Equivalence, Unambiguity and Sequentiality Problems of Finitely Ambiguous Max-Plus Tree Automata are Decidable

A max-plus automaton is a finite automaton with transition weights in the real numbers. To each word, it assigns the maximum weight of all accepting paths on the word, where the weight of a path is the sum of the path’s transition weights. Max-plus automata and their min-plus counterparts are weighted automata [19, 18, 13, 2, 4] over the max-plus or min-plus semiring. Under varying names, max-p...

متن کامل

Some Automata{theoretic Aspects of Min{max{plus Semirings

This paper is devoted to the survey of some automata-theoretic aspects of diierent exotic semirings, i.e. semirings whose underlying set is some subset of R equiped with min, max or + as sum and/or product. We here adress three types of properties related with rational series with multiplicities in such semirings : structure of supports, decidability of equality and inequality problems, Fatou p...

متن کامل

On min - max - plus systems , nonexpansive mappings and periodic solutions

A selection of these reports is available in PostScript form at the Faculty's anonymous ftp-Abstract Systems in which the operations min, max and addition appear simultaneously are called min-max-plus systems. Such systems, which are extensions of timed discrete event systems (which on their turn are based on the max-plus algebra, i.e. on the operations max and addition only), have been studied...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • ITA

دوره 40  شماره 

صفحات  -

تاریخ انتشار 2006